Reasoning with Large A-Boxes in Fuzzy Description Logics using DL reasoners: An experimental evaluation
نویسندگان
چکیده
While knowledge representation languages developed in the context of the Semantic Web build mainly on crisp knowledge, fuzzy reasoning seems to be needed for many applications, e.g. for retrieval of images or other resources. However, techniques for fuzzy reasoning need to scale to large A-Boxes for practical applications. As a first step towards clarifying whether fuzzy reasoning techniques can indeed scale, we examine a specific point in space. Earlier research has shown that fuzzy description logics can be transformed to crisp description logics in a satisfiability-preserving fashion. This thus opens the possibility of using standard description logic reasoners for reasoning with fuzzy OWL ontologies. As the transformation produces a quadratic blow-up of the T-Box, a crucial question is if such an approach is feasible from a performance point of view. We provide an empirical evaluation on four different ontologies of varying complexity and with generated A-Boxes of up to a million individuals. To our knowledge, we thus provide the first systematic and empirical evaluation of a fuzzy reasoning approach based on a reduction to standard description logics.
منابع مشابه
Supporting Fuzzy Rough Sets in Fuzzy Description Logics
Classical Description Logics (DLs) are not suitable to represent vague pieces of information. The attempts to achieve a solution have lead to the birth of fuzzy DLs and rough DLs. In this work, we provide a simple solution to join these two formalisms and define a fuzzy rough DL. We also show how to extend two reasoning algorithms for fuzzy DLs, which are implemented in the fuzzy DL reasoners f...
متن کاملTableau-Based ABox Abduction for Description Logics: Preliminary Report
ABox abduction is an important reasoning problem for description logics (DL) with applications in diagnosis, manufacturing control, multimedia interpretation, etc. Several abductive reasoners for DL were designed and implemented using a translation to first-order logic or logic programming. Algorithms for ABox abduction based directly on native DL reasoning techniques, such as tableau algorithm...
متن کاملTowards Real Time Ontology Editing
Recently there has been substantial development of OWL ontology engineering tools. Such tools typically come equipped with fully functional Description Logic (DL) reasoners, as both OWL-Lite and OWL-DL are formally aligned with Description Logics. One main limitation of editors is that the underlying reasoners cannot be continuously turned on while editing large, expressive ontologies, due to t...
متن کاملReasoning Algebraïcally with Description Logics
Reasoning Algebräıcally with Description Logics Jocelyne Faddoul, Ph.D. Concordia University, 2011 Semantic Web applications based on the Web Ontology Language (OWL) often require the use of numbers in class descriptions for expressing cardinality restrictions on properties or even classes. Some of these cardinalities are specified explicitly, but quite a few are entailed and need to be discove...
متن کاملCP4DL: Constraint-based Reasoning for Expressive Description Logics
Description logics (DLs) are a family of logic-based knowledge representation formalisms, which provide underlying semantics for modern ontology languages such as OWL 2. Reasoners for DLs are mostly specialised algorithms, which can answer questions such as whether an ontology as a whole is consistent, whether a certain concept in an ontology can be non-empty, or whether one concept subsumes an...
متن کامل